Production of a Discrete, Infectious, Double-stranded DNA by Reverse Transcription in Virions of Moloney Murine Leukemia Virus

One of the most unique viral replication schemes is that of the retroviruses (a class that includes the RNA tumor viruses). These viruses synthesize a double-stranded (DS) DNA copy of their single-stranded (SS) RNA genome as the initial event following infection of susceptible cells (see Weinberg 1977). The details of this process—called reverse transcription—are still obscure, but the general outlines have become clear during the last few years

Preventing Pseudomonas aeruginosa and Chromobacterium violaceum infections by anti-adhesion-active components of edible seeds

<p>Abstract</p> <p>Background</p> <p><it>Pseudomonas aeruginosa </it>adhesion to animal/human cells for infection establishment involves adhesive proteins, including its galactose- and fucose-binding lectins PA-IL (LecA) and PA-IIL (LecB). The lectin binding to the target-cell receptors may be blocked by compatible glycans that compete with those of the receptors, functioning as anti-adhesion glycodecoys. The anti-adhesion treatment is of the utmost importance for abrogating devastating antibiotic-resistant <it>P. aeruginosa </it>infections in immunodeficient and cystic fibrosis (CF) patients. This strategy functions in nature in protecting embryos and neonates. We have shown that PA-IL, PA-IIL, and also CV-IIL (a PA-IIL homolog produced in the related pathogen <it>Chromobacterium violaceum</it>) are highly useful for revealing natural glycodecoys that surround embryos in diverse avian eggs and are supplied to neonates in milks and royal jelly. In the present study, these lectins were used as probes to search for seed embryo-protecting glycodecoys.</p> <p>Methods</p> <p>The lectin-blocking glycodecoy activities were shown by the hemagglutination-inhibition test. Lectin-binding glycoproteins were detected by Western blotting with peroxidase-labeled lectins.</p> <p>Results</p> <p>The present work reports the finding - by using PA-IL, PA-IIL, and CV-IIL - of rich glycodecoy activities of low (< 10 KDa) and high MW (> 10 kDa) compounds (including glycoproteins) in extracts of cashew, cocoa, coffee, pumpkin, and tomato seeds, resembling those of avian egg whites, mammal milks, and royal jelly.</p> <p>Conclusions</p> <p>Edible seed extracts possess lectin-blocking glycodecoys that might protect their embryos from infections and also might be useful for hampering human and animal infections.</p

Learn your opponent's strategy (in polynomial time)!

Agents that interact in a distributed environment might increase their utility by behaving optimally given the strategies of the other agents. To do so, agents need to learn about those with whom they share the same world. This paper examines interactions among agents from a game theoretic perspective. In this context, learning has been assumed as a means to reach equilibrium. We analyze the complexity of this learning process. We start with a restricted two-agent model, in which agents are represented by finite automata, and one of the agents plays a fixed strategy. We show that even with this restrictions, the learning process may be exponential in time. We then suggest a criterion of simplicity, that induces a class of automata that are learnable in polynomial time

Temporal Construal Effects Are Independent of Episodic Future Thought

Human thought is prone to biases. Some biases serve as beneficial heuristics to free up limited cognitive resources or improve well-being, but their neurocognitive basis is unclear. One such bias is a tendency to construe events in the distant future in abstract, general terms and events in the near future in concrete, detailed terms. Temporal construal may rely on our capacity to orient toward and/or imagine context-rich future events. We tested 21 individuals with impaired episodic future thinking resulting from lesions to the hippocampus or ventromedial prefrontal cortex (vmPFC) and 57 control participants (aged 45-76 years) from Canada and Italy on measures sensitive to temporal construal. We found that temporal construal persisted in most patients, even those with impaired episodic future thinking, but was abolished in some vmPFC cases, possibly in relation to difficulties forming and maintaining future intentions. The results confirm the fractionation of future thinking and that parts of vmPFC might critically support our ability to flexibly conceive and orient ourselves toward future events

Production of a Discrete, Infectious, Double-stranded DNA by Reverse Transcription in Virions of Moloney Murine Leukemia Virus

One of the most unique viral replication schemes is that of the retroviruses (a class that includes the RNA tumor viruses). These viruses synthesize a double-stranded (DS) DNA copy of their single-stranded (SS) RNA genome as the initial event following infection of susceptible cells (see Weinberg 1977). The details of this process—called reverse transcription—are still obscure, but the general outlines have become clear during the last few years

Development of the Fetal Vermis: New Biometry Reference Data and Comparison of 3 Diagnostic Modalities-3D Ultrasound, 2D Ultrasound, and MR Imaging

Normal biometry of the fetal posterior fossa rules out most major anomalies of the cerebellum and vermis. Our aim was to provide new reference data of the fetal vermis in 4 biometric parameters by using 3 imaging modalities, 2D ultrasound, 3D ultrasound, and MR imaging, and to assess the relation among these modalities. A retrospective study was conducted between June 2011 and June 2013. Three different imaging modalities were used to measure vermis biometry: 2D ultrasound, 3D ultrasound, and MR imaging. The vermian parameters evaluated were the maximum superoinferior diameter, maximum anteroposterior diameter, the perimeter, and the surface area. Statistical analysis was performed to calculate centiles for gestational age and to assess the agreement among the 3 imaging modalities. The number of fetuses in the study group was 193, 172, and 151 for 2D ultrasound, 3D ultrasound, and MR imaging, respectively. The mean and median gestational ages were 29.1 weeks, 29.5 weeks (range, 21-35 weeks); 28.2 weeks, 29.05 weeks (range, 21-35 weeks); and 32.1 weeks, 32.6 weeks (range, 27-35 weeks) for 2D ultrasound, 3D ultrasound, and MR imaging, respectively. In all 3 modalities, the biometric measurements of the vermis have shown a linear growth with gestational age. For all 4 biometric parameters, the lowest results were those measured by MR imaging, while the highest results were measured by 3D ultrasound. The inter- and intraobserver agreement was excellent for all measures and all imaging modalities. Limits of agreement were considered acceptable for clinical purposes for all parameters, with excellent or substantial agreement defined by the intraclass correlation coefficient. Imaging technique-specific reference data should be used for the assessment of the fetal vermis in pregnanc

Positive approximations of the inverse of fractional powers of SPD M-matrices

This study is motivated by the recent development in the fractional calculus and its applications. During last few years, several different techniques are proposed to localize the nonlocal fractional diffusion operator. They are based on transformation of the original problem to a local elliptic or pseudoparabolic problem, or to an integral representation of the solution, thus increasing the dimension of the computational domain. More recently, an alternative approach aimed at reducing the computational complexity was developed. The linear algebraic system $\cal A^\alpha \bf u=\bf f$, $0< \alpha <1$ is considered, where $\cal A$ is a properly normalized (scalded) symmetric and positive definite matrix obtained from finite element or finite difference approximation of second order elliptic problems in $\Omega\subset\mathbb{R}^d$, $d=1,2,3$. The method is based on best uniform rational approximations (BURA) of the function $t^{\beta-\alpha}$ for $0 < t \le 1$ and natural $\beta$. The maximum principles are among the major qualitative properties of linear elliptic operators/PDEs. In many studies and applications, it is important that such properties are preserved by the selected numerical solution method. In this paper we present and analyze the properties of positive approximations of $\cal A^{-\alpha}$ obtained by the BURA technique. Sufficient conditions for positiveness are proven, complemented by sharp error estimates. The theoretical results are supported by representative numerical tests

Searching for network modules

When analyzing complex networks a key target is to uncover their modular structure, which means searching for a family of modules, namely node subsets spanning each a subnetwork more densely connected than the average. This work proposes a novel type of objective function for graph clustering, in the form of a multilinear polynomial whose coefficients are determined by network topology. It may be thought of as a potential function, to be maximized, taking its values on fuzzy clusterings or families of fuzzy subsets of nodes over which every node distributes a unit membership. When suitably parametrized, this potential is shown to attain its maximum when every node concentrates its all unit membership on some module. The output thus is a partition, while the original discrete optimization problem is turned into a continuous version allowing to conceive alternative search strategies. The instance of the problem being a pseudo-Boolean function assigning real-valued cluster scores to node subsets, modularity maximization is employed to exemplify a so-called quadratic form, in that the scores of singletons and pairs also fully determine the scores of larger clusters, while the resulting multilinear polynomial potential function has degree 2. After considering further quadratic instances, different from modularity and obtained by interpreting network topology in alternative manners, a greedy local-search strategy for the continuous framework is analytically compared with an existing greedy agglomerative procedure for the discrete case. Overlapping is finally discussed in terms of multiple runs, i.e. several local searches with different initializations.Comment: 10 page